Stabilizing Certificate Dispersal

Stabilizing Certificate Dispersal

A certificate issued by a user u for another user v enables any user that knows the public key of u to obtain the public key of v. A certificate dispersal D assigns a set of certificates D.u to each user u in the system so that user u can find a public key of any other user v without consulting a third party. In this paper, we present a stabilizing certificate dispersal protocol that tolerates ...

Minimum Certificate Dispersal with Tree Structures

Given an n-vertex graph G = (V,E) and a set R ⊆ {{x, y} | x, y ∈ V } of requests, we consider to assign a set of edges to each vertex in G so that for every request {u, v} in R the union of the edge sets assigned to u and v contains a path from u to v. The Minimum Certificate Dispersal Problem (MCD) is defined as one to find an assignment that minimizes the sum of the cardinality of the edge se...

Approximability and inapproximability of the minimum certificate dispersal problem

Given an n-vertex directed graph G = (V , E) and a set R ⊆ V × V of requests, we consider assigning a set of edges to each vertex in G so that for every request (u, v) in R the union of the edge sets assigned to u and v contains a path from u to v. The Minimum Certificate Dispersal Problem (MCD) is defined as one to find an assignment that minimizes the sum of the cardinalities of the edge sets...

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem

Given a graph G = (V, E) and a set R ⊆ V × V of requests, we consider to assign a set of edges to each node in G so that for every request (u, v) in R the union of the edge sets assigned to u and v contains a path from u to v. The Minimum Certificate Dispersal Problem (MCD) is defined as one to find an assignment that minimizes the sum of the cardinality of the edge set assigned to each node. I...

Certificate and Certificate Revocation List (CRL) Profile